Finitizable set of reductions for polyhedral quadrangulations of closed surfaces
نویسندگان
چکیده
In this paper, we discuss generating theorems of polyhedral quadrangulations closed surfaces. We prove that the set eight reductional operations {R1, …, R8} defined for is finitizable any surface F2, is, there exist finitely many minimal F2 using such R1, R7 and R8. Furthermore, show proper subset not torus.
منابع مشابه
Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph
Although surfaces are more and more often represented by dense triangulations, it can be useful to convert them to B-spline surface patches, lying on quadrangles. This paper presents a method for the construction of coarse topological quadrangulations of closed triangulated surfaces, based on Morse theory. In order to construct on the surface a quadrangulation of its canonical polygonal schema,...
متن کاملDetection of constrictions on closed polyhedral surfaces
We define constrictions on a surface as simple closed geodesic curves, i.e. curves whose length is locally minimal. They can be of great interests in order to cut the surface in smaller parts. In this paper, we present a method to detect constrictions on closed triangulated surfaces. Our algorithm is based on a progressive approach. First, the surface is simplified by repeated edge collapses. T...
متن کاملAn Experimental Comparison of Algorithms for Converting Triangulations of Closed Surfaces into Quadrangulations
We perform an experimental comparison of four algorithms for converting a given triangulation T of an orientable, connected, boundaryless, and compact surface S in E into a quadrangulation Q of S. All algorithms compute Q by first pairing edge-adjacent triangles of T (of another triangulation of S with the same vertex set) so that every triangle belongs to exactly one pair. Such a perfect pairi...
متن کاملLocal chromatic number of quadrangulations of surfaces
The local chromatic number of a graph G, as introduced in [4], is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors. In [17] a connection of the local chromatic number to topological properties of (a box complex of) the graph was established and in [18] it was shown that a topological ...
متن کاملRigidity of Polyhedral Surfaces
We study the rigidity of polyhedral surfaces using variational principle. The action functionals are derived from the cosine laws. The main focus of this paper is on the cosine law for a non-triangular region bounded by three possibly disjoint geodesics. Several of these cosine laws were first discovered and used by Fenchel and Nielsen. By studying the derivative of the cosine laws, we discover...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2022
ISSN: ['1855-3974', '1855-3966']
DOI: https://doi.org/10.26493/1855-3974.2704.31a